New families of Q-polynomial association schemes
نویسندگان
چکیده
In this paper, we construct the first known infinite family of primitive Qpolynomial schemes which are not generated by distance-regular graphs. To construct these examples, we introduce the notion of a relative hemisystem of a generalized quadrangle with respect to a subquadrangle.
منابع مشابه
Some new constructions of imprimitive cometric association schemes
In a recent paper [9], the authors introduced the extended Q-bipartite double of an almost dual bipartite cometric association scheme. Since the association schemes arising from linked systems of symmetric designs are almost dual bipartite, this gives rise to a new infinite family of 4-class cometric schemes which are both Q-bipartite and Q-antipodal. These schemes, the schemes arising from lin...
متن کاملOn Relative $t$-Designs in Polynomial Association Schemes
Motivated by the similarities between the theory of spherical t-designs and that of t-designs in Q-polynomial association schemes, we study two versions of relative t-designs, the counterparts of Euclidean t-designs for P and/or Q-polynomial association schemes. We develop the theory based on the Terwilliger algebra, which is a noncommutative associative semisimple C-algebra associated with eac...
متن کاملImprimitive cometric association schemes: Constructions and analysis
Dualizing the “extended bipartite double” construction for distance-regular graphs, we construct a new family of cometric (or Q-polynomial) association schemes with four associate classes based on linked systems of symmetric designs. The analysis of these new schemes naturally leads to structural questions concerning imprimitive cometric association schemes, some of which we answer with others ...
متن کاملAn Algorithmic Approach to the Extensibility of Association Schemes
An association scheme which is associated to a height t presuperscheme is said to be extensible to height t. Smith (1994, 2007) showed that an association scheme X = (Q,Γ) of order d := |Q| is Schurian iff X is extensible to height (d − 2). In this work, we formalize the maximal height tmax(X) of an association scheme X as the largest number t ∈ N such that X is extensible to height t (we also ...
متن کاملOn Q-Polynomial Association Schemes of Small Class
We show an inequality involving the third largest or second smallest dual eigenvalues of Q-polynomial association schemes of class at least three. Also we characterize dual-tight Q-polynomial association schemes of class three. Our method is based on tridiagonal matrices and can be applied to distance-regular graphs as well.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 118 شماره
صفحات -
تاریخ انتشار 2011